Distributed processing uses local computations at each node and communications among neighboring nodes to solve the problems over the entire network. Diffusion is one of the methods for performing distributed networks. This paper presents a novel Variable Step-Size Diff More
Distributed processing uses local computations at each node and communications among neighboring nodes to solve the problems over the entire network. Diffusion is one of the methods for performing distributed networks. This paper presents a novel Variable Step-Size Diffusion Affine Projection Algorithm (VSS-DAPA) to improve the performance of the Diffusion Affine Projection Algorithm (DAPA) in distributed networks. The variable step-size of each node is obtained by minimizing the Mean-Square Deviation (MSD) in that node. In comparison with Diffusion Affine Projection Algorithm (DAPA), the VSS-DAPA algorithm has faster convergence speed and lower steady-state error. To reduce the computational complexity of VSS-DAPA, the Variable Step-Size Selective Regressors Diffusion Affine Projection Algorithm (VSS-SR-DAPA), the Variable Step-Size Dynamic Selection of Diffusion Affine Projection Algorithm (VSS-DS-DAPA) and Variable Step-Size Selective Partial Update Diffusion Affine Projection Algorithm (VSS-SPU-DAPA) are proposed. Simulation results show the good performance of proposed algorithms in convergence speed and steady-state error.
Manuscript profile
